Performance Analysis of Chain Code Descriptor for Hand Shape Classification
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولMultiscale Fourier descriptor for shape classification
The description of the object shape is an important characteristic of the image. In image processing and pattern recognition, several different shape descriptors are used. In human visual perception, the shapes are processed in multiple resolutions. Therefore multiscale shape representation is essential in the shape based image classification and retrieval. In the description of the object shap...
متن کاملMulti-scale embedded descriptor for shape classification
We present a new shape descriptor that are robust to deformation and capture part details. In our framework, the shape descriptor is generated by 1) using running angle to transforming a shape into a 2-D description image in the position and scale space. 2) performing circular wavelet-like sub-band decomposition of this 2-D description image based on its periodic convolution with orthogonal ker...
متن کاملShape Analysis for Augmented Topological Shape Descriptor
In this work we propose a scheme for analysis of the shape of a 3D model. We use Extended Reeb Graph to describe the topological structure of the model which we further enrich with extracted geometrical features. The nodes of the graph represent different components of the model, and we propose to analyze their shape separately. Shape characteristics such as taper/enlargement, average curvature...
متن کاملSIFT Descriptor for Binary Shape Discrimination, Classification and Matching
In this work, we study efficiency of SIFT descriptor in discrimination of binary shapes. We also analyze how the use of 2 − tuples of SIFT keypoints can affect discrimination of shapes. The study is divided into two parts, the first part serves as a primary analysis where we propose to compute overlap of classes using SIFT and a majority vote of keypoints. In the second part, we analyze both cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Graphics & Animation
سال: 2014
ISSN: 2231-3591,2231-3281
DOI: 10.5121/ijcga.2014.4202